nLab iterated localization

Redirected from "automorphism n-group".
Contents

Contents

Idea

Iterated localizations are, to a first approximation, functors right orthogonal to conservative functors, i.e. the class of functors obtained from factoring any functor as some functor followed by a conservative functor.

For the correct statement one needs to regard Cat \mathbf{Cat} as a 2-category, or at least as a model category.

Definition

Given a small category CC and a set of morphisms SMor(C)S \subset Mor(C), we can always construct the localization category C[S 1]C[S^{-1}] which is universal in the sense that every functor F:CDF \colon C \to D which inverts all the morphisms in SS factors through it (see localization):

On the other hand, it is often interesting to look at which morphisms of CC become isomorphisms under the action of a functor F:CDF \colon C \to D (e.g. FF might be a cohomology theory and we want to assess which maps in CC are quasi-isomorphisms).

Call kerF\ker F the class of maps in CC which are inverted by FF (ndr: this isn’t standard notation). Then we can localize CC at kerF\ker F and thus factor FF as a localization L 1L_1 followed by a functor F 1:C[kerF 1]DF_1:C[\ker F^{-1}] \to D:

It turns out that this F 1F_1, in general, still inverts further morphisms. Therefore it makes sense to iterate this process to obtain the following sequence of functors:

where C n+1C[kerF n 1]C_{n+1} \coloneqq C[\ker F_n^{-1}].

Now consider the colimit

C ωcolim nC n C_\omega \,\coloneqq\, \colim_n C_n

of this sequence of localizations. Clearly there is a canonical functor L:CC ωL \colon C \to C_\omega and also a mediating map

(1)K:C ωD K \,\colon\, C_\omega \to D

such that KL=FK\circ L = F. In fact, one can prove that KK is conservative.

Definition

A functor F:CDF \colon C \to D is an iterated localization if KK (1) is an equivalence.

This makes (iterated localizations,conservative functors)\big(\text{iterated localizations}, \text{conservative functors}\big) a(n homotopy) factorization system on Cat\mathbf{Cat} (considered as a 1-category with weak equivalences given by equivalences of categories).

See also

References

The above is pretty much directly taken from:

Last revised on August 29, 2024 at 15:24:53. See the history of this page for a list of all contributions to it.